Improved Minimum Spanning Tree Heuristics for Steiner Tree problem in graph
نویسندگان
چکیده
The minimum Steiner tree problem, a classical combinatorial optimization problem with a long history, is a NP-complete problem. Due to its wide application, study of heuristic algorithm about Steiner tree problem has important practical and theoretical significance. In this paper we first review one of the existing algorithms for solving the Steiner problem in graphs, Minimum Spanning Tree Heuristic algorithm, then presenting a new heuristic algorithm IMSTH to improve it. We describe our algorithm and its computational results. It is shown that our algorithm can effectively improve the performance on MSTH.
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملThree New Heuristics for the Steiner Problem in Graphs
Given a connected graph G = (V,E) (undirected, without loops and multiple edges) with positive edge costs (called also lengths) and a set Z ⊂ V of special (distinguished) vertices, the Steiner problem on graphs (networks) asks for a minimum cost tree within G that spans all members of Z. If |Z| = 2 we have the shortest path problem and if Z = V we get the minimum spanning tree problem, which ar...
متن کاملConcatenation - Based Greedy Heuristics for the Euclidean
We present a class of O(n log n) heuristics for the Steiner tree problem in the Euclidean plane. These heuristics identify a small number of subsets with few, geometrically close, terminals using minimum spanning trees and other well-known structures from computational geometry: De-launay triangulations, Gabriel graphs, relative neighbourhood graphs, and higher-order Voronoi diagrams. Full Stei...
متن کاملHierarchies to Solve Constrained Connected Spanning Problems
Given a graph and a set of vertices, searching for a connected and minimum cost structure which spans the vertices is a classic problem. When no constraints are applied, the minimum cost spanning structure is a sub-graph corresponding to a tree. If all the vertices in the graph should be spanned the problem is referred to as minimum spanning tree (MST) construction and polynomial time algorithm...
متن کاملCS261 - Optimization Paradigms Lecture Notes for 2009-2010 Academic Year
Given a connected graph G = (V, E) with non-negative edge costs, and a set of " special " nodes S ⊂ V , a subgraph of G is a Steiner tree, if it is a tree that spans (connects) all the (" special ") nodes in S. The Steiner Tree problem is to find a Steiner Tree of minimum weight (cost). Steiner Tree is an important NP-hard problem that is often encountered in practice. Examples include design o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012